Notes on the linear - al ulus and LLP Kohei Honda ?

Notes on Linear Typing for Free Output

Strong Normalisation in the π-Cal ulus

We introduce a typed π-calculus where strong normalisation is ensured by typability. Strong normalisation is a useful property in many computational contexts, including distributed systems. In spite of its simplicity, our type discipline captures a wide class of converging name-passing interactive behaviour. The proof of strong normalisability combines methods from typed λ-calculi and linear lo...

Notes on P - Algebra ( 2 ) : Group Presentation of Process Structure

We give yet another presentation of the process structures introduced in [1] and prove its equivalence to the original one. The presentation enjoys several convenient features not found in the original presentation, though in compensation for a certain loss of simplicity. Among others, it dispenses with the use of a choice function for quotient construction. The new presentation o ers a di eren...

Translating a Linear Logic Programming Language into Java

There have been several proposals for logic programming language based on linear logic: Lolli [8], Lygon [7], LO [3], LinLog [2], Forum [11], HACL [10]. In these languages, it is possible to create and consume resources dynamically as logical formulas. The efficient handling of resource formulas is, therefore, an important issue in the implementation of these languages. Lolli, Lygon, and Forum ...

Notes on P - Algebra ( 1 ) : Process Structures

We develop an elementary theory of process structure, a mathematical object which is intended to capture a basic aspect of concurrent processes in a simple way. It has two kinds of presentations: one underlies many extant process theories and another has a more geometric avour. We prove these are essentially equivalent. The theory forms a basis of P-algebra, a general semantic structure for con...